Multidimensional trees

Representing Multidimensional Trees

This paper develops a formal definition of multidimensional trees as abstract structures in “left-child, right-sibling” form. After developing this abstract definition, we show how it can be directly implemented as an ADT suitable for use in parsing applications. Additionally, we show how, when viewed in a slightly different way, our definition yields a flat form suitable for serialized input a...

Multidimensional Balanced Binary Trees

A bstract-A new balanced multidimensional tree structure called a k-dimensional balanced binary tree, k a positive integer, is presented and investigated. It is shown that the data structure can be used to manage a set of n k-dimensional data items such that access, insertion, and deletion operations can be supported in Ooog n + k) time. The data structure is a multidimensional generalization o...

Compressed Multidimensional Trees for Evolutionary Music Representation

This paper investigates the performance and suitability of evolutionary algorithms for music composition by enhancing representation schemes. First, we argue that genetic programming (GP) is well suited to capture higher order musical structures due to its hierarchical representation. Representational enhancements are proposed on the standard GP tree: considering different branches for differen...

Multidimensional Searching Trees with Minimum Attribute

Multidimensional Access Methods: Trees Have Grown Everywhere

This paper is a survey of work and issues on multidimensional search trees. We provide a classification of such methods, we describe the related algorithms, we present performance analysis efforts, and finally outline future research directions. Multi-dimensional search trees and Spatial Access Methods, in general, are designed to handle spatial objects, like points, line segments, polygons, po...